Distance-constraint reachability computation in uncertain graphs
نویسندگان
چکیده
منابع مشابه
Distance-Constraint Reachability Computation in Uncertain Graphs
Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call the distance-constraint reachability (DCR) problem: Given two vertices s and t, what is the probability that the distance from s to t is less than or equal to a user-defined threshold d...
متن کاملLanguage-Constraint Reachability Learning in Probabilistic Graphs
The probabilistic graphs framework models the uncertainty inherent in realworld domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, ...
متن کاملEfficient processing of label-constraint reachability queries in large graphs
In this paper, we study a variant of reachability queries, called label-constraint reachability (LCR) queries. Specifically, given a label set S and two vertices u1 and u2 in a large directed graph G, we check the existence of a directed path from u1 to u2, where edge labels along the path are a subset of S. We propose the path-label transitive closure method to answer ted DAG by replacing the ...
متن کاملFast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic analyzing, Web navigation, semantic web, chemical informatics and bio-informatics systems, and computer vision. A graph reachability query, as one of the primary tasks, is to find whether two given data objects, u an...
متن کاملConstraint-based reachability
Interpretation (AI) is a theoretical framework introduced by Cousot and Cousot in [10] to manipulate abstractions of program states. An abstraction can be used to simplify program analysis problems otherwise not computable in realistic time, to manageable problems more easily solvable. Instead of working on the concrete semantics of a program1, AI computes results over an abstract semantics all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2011
ISSN: 2150-8097
DOI: 10.14778/2002938.2002941